On the Number of Faces of Certain Transportation Polytopes
نویسنده
چکیده
Define the transportation polytope Tn,m to be a polytope of non-negative n×m matrices with row sums equal to m and column sums equal to n. We present a new recurrence relation for the numbers fk of the k-dimensional faces for the transportation polytope Tn,n+1. This gives an efficient algorithm for computing the numbers fk , which solves the problem known to be computationally hard in a general case.
منابع مشابه
Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable
Provan and Billera defined the notion of weak k-decomposability for pure simplicial complexes in the hopes of bounding the diameter of convex polytopes. They showed the diameter of a weakly k-decomposable simplicial complex ã is bounded above by a polynomial function of the number of k-faces in ã and its dimension. For weakly 0-decomposable complexes, this bound is linear in the number of verti...
متن کاملComputing the Number of Faces of Transportation Polytopes in Polynomial Time
Deene transportation polytope Tn;m to be a polytope of nonnegative n m matrices with row sums equal to m and column sums equal to n. We present an eecient algorithm for computing the numbers f k of the k-dimensional faces for the transportation polytope T n;n+1. The construction relies on the new recurrence relation for the numbers f i , which is of independent interest.
متن کاملOn Gale and braxial polytopes
Cyclic polytopes are characterized as simplicial polytopes satisfying Gale’s evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which certain subpolytopes are cyclic. Bisztriczky discovered a class of periodically-cyclic polytopes that also satisfy Gale’s evenness condition. The faces of these po...
متن کاملMcMullen's Conditions and Some Lower Bounds for General Convex Polytopes
Convex polytopes are the d-dimensional analogues of 2-dimensional convex polygones and 3-dimensional convex polyhedra. A polytope is a bounded convex set in R d that is the intersection of a finite number of closed halfspaces. The faces of a polytope are its intersections with supporting hyperplanes. The/-dimensional faces are called the i-faces and f i ( P ) denotes the number of i-faces of a ...
متن کاملMaximal f-vectors of Minkowski sums of large numbers of polytopes
It is known that in the Minkowski sum of r polytopes in dimension d, with r < d, the number of vertices of the sum can potentially be as high as the product of the number of vertices in each summand [2]. However, the number of vertices for sums of more polytopes was unknown so far. In this paper, we study sums of polytopes in general orientations, and show a linear relation between the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2000